Practical Forward-Secure Range and Sort Queries with Update-Oblivious Linked Lists

Practical Forward-Secure Range and Sort Queries with Update-Oblivious Linked Lists

We revisit the problem of privacy-preserving range search and sort queries on encrypted data in the face of an untrusted data store. Our new protocol RASP has several advantages over existing work. First, RASP strengthens privacy by ensuring forward security: after a query for range [a,b], any new record added to the data store is indistinguishable from random, even if the new record falls with...

Oblivious Radix Sort: An Efficient Sorting Algorithm for Practical Secure Multi-party Computation

We propose a simple and efficient sorting algorithm for secure multiparty computation (MPC). The algorithm is designed to be efficient when the number of parties and the size of the underlying field are small. For a constant number of parties and a field with a constant size, the algorithm has O(n log n) communication complexity, which is asymptotically the same as the best previous algorithm b...

Range Mode and Range Median Queries on Lists and Trees

We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on the path from u to v.

Practical and Lock-Free Doubly Linked Lists

Forward-Secure Signatures with Fast Key Update

In regular digital signatures, once the secret key is compromised, all signatures, even those that were issued by the honest signer before the compromise, will not be trustworthy any more. Forward-secure signatures have been proposed to address this major shortcoming. We present a new forward-secure signature scheme, called KREUS, with several advantages. It has the most efficient Key Update of...